Combinatorial enumeration of cyclic covers of P1

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial Description of Knot Floer Homology of Cyclic Branched Covers

In this paper, we introduce a simple combinatorial method for computing all versions (∧,+,−,∞) of the knot Floer homology of the preimage of a two-bridge knot Kp,q inside its double-branched cover, −L(p, q). The 4-pointed genus 1 Heegaard diagram we obtain looks like a twisted version of the toroidal grid diagrams recently introduced by Manolescu, Ozsváth, and Sarkar. We conclude with a discuss...

متن کامل

Rank Gradient of Cyclic Covers

If M is an orientable hyperbolic 3-manifold with finite volume and φ : π1(M) Z, the family of covers corresponding to {φ−1(nZ) |n ∈ N} has rank gradient 0 if and only if the Poincaré–Lefschetz dual of the class in H1(M ; Z) corresponding to φ is represented by a fiber. This generalizes a theorem of M. Lackenby. If M is closed, we give an explicit lower bound on the rank gradient. The proof uses...

متن کامل

Fast Enumeration of Combinatorial Objects

The problem of ranking (or perfect hashing) is well known in Combinatorial Analysis, Computer Science, and Information Theory. There are widely used methods for ranking permutations of numbers {1, 2, ..., n}, n ≥ 1, for ranking binary words of length n with a fixed number of ones and for many other combinatorial problems. Many of these methods have nonexponential memory size and the time of enu...

متن کامل

Combinatorial Polytope Enumeration

We describe a provably complete algorithm for the generation of a tight, possibly exact, superset of all combinatorially distinct simple n-facet polytopes in Rd, along with their graphs, f -vectors, and face lattices. The technique applies repeated cutting planes and planar sweeps to a d−simplex. Our generator has implications for several outstanding problems in polytope theory, including conje...

متن کامل

Combinatorial Covers and Vanishing Cohomology

We use a Mayer–Vietoris-like spectral sequence to establish vanishing results for the cohomology of complements of linear and elliptic hyperplane arrangements, as part of a more general framework involving duality and abelian duality properties of spaces and groups. In the process, we consider cohomology of local systems with a general, Cohen– Macaulay-type condition. As a result, we recover kn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS

سال: 2018

ISSN: 1300-0098,1303-6149

DOI: 10.3906/mat-1610-84